Evans' Normal Form Theorem Revisited

نویسنده

  • Jonathan D. H. Smith
چکیده

Evans defined quasigroups equationally, and proved a Normal Form Theorem solving the word problem for free extensions of partial Latin squares. In this paper, quasigroups are redefined as algebras with six basic operations related by triality, manifested as coupled right and left regular actions of the symmetric group on three symbols. Triality leads to considerable simplifications in the proof of Evans’ Normal Form Theorem, and makes it directly applicable to each of the six major varieties of quasigroups defined by subgroups of the symmetric group. Normal form theorems for the corresponding varieties of idempotent quasigroups are obtained as immediate corollaries.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Conservation Theorem revisited

This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS , and we prove that any λ-term that has a βIβS-normal form is strongly β-normalizable. We show how to use this result to prove the strong normalization of different typed λ-calculi.

متن کامل

Wick ’ s Theorem for non - symmetric normal ordered products and contractions

We consider arbitrary splits of field operators into two parts; ψ = ψ + +ψ − , and use the corresponding definition of normal ordering introduced in [1]. In this case the normal ordered products and contractions have none of the special symmetry properties assumed in existing proofs of Wick's theorem. Despite this, we prove that Wick's theorem still holds in its usual form as long as the contra...

متن کامل

Kleene, Rogers and Rice Theorems Revisited in C and in Bash

The recursion theorem in the weak form {e}(z) = x(e, z) (universal function not needed) and in Rogers form φφf(n)(z) = φn(z), and Rice theorem are proved a first time using programs in C, and a second time with scripts in Bash.

متن کامل

Chrobak Normal Form Revisited, with Applications

It is well known that any nondeterministic finite automata over a unary alphabet can be represented in a certain normal form called the Chrobak normal form [1]. We present a very simple conversion procedure working in O(n) time. Then we extend the algorithm to improve two trade-offs concerning conversions between different representations of unary regular languages. Given an n-state NFA, we are...

متن کامل

Quantitative Semantics Revisited (extended Abstract)

In the coherence space semantics of linear logic, the webs of the spaces interpreting the exponentials may be deened using multi-cliques (multisets whose supports are cliques) instead of cliques. Inspired by the quantitative semantics of Jean-Yves Girard, we give a characterization of the morphisms of the co-Kleisly category of the corresponding comonad (this category is cartesian closed and, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJAC

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2007